An Improved Local Search Algorithm for 3-SAT
نویسندگان
چکیده
We slightly improve the pruning technique presented in Dantsin et. al. (2002) to obtain an O∗ (1.473n) algorithm for 3-SAT.
منابع مشابه
On the Performance of Congestion Games for Optimum Satisfiability Problems
We introduce and study a congestion game having max sat as an underlying structure and show that its price of anarchy is 1/2. The main result is a redesign of the game leading to an improved price of anarchy of 2/3 from which we derive a non oblivious local search algorithm for max sat with locality gap 2/3. A similar congestion min sat game is also studied. keywords: price of anarchy, non obli...
متن کاملLocal search for Boolean Satisfiability with configuration checking and subscore
This paper presents and analyzes two new efficient local search strategies for the Boolean Satisfiability (SAT) problem. We start by proposing a local search strategy called configuration checking (CC) for SAT. The CC strategy results in a simple local search algorithm for SAT called Swcc, which shows promising experimental results on random 3-SAT instances, and outperforms TNM, the winner of S...
متن کاملA Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملDeterministic Algorithms for k-SAT Based on Covering Codes and Local Search
We show that satisfiability of formulas in k-CNF can be decided deterministically in time close to (2k/(k + 1)), where n is the number of variables in the input formula. This is the best known worstcase upper bound for deterministic k-SAT algorithms. Our algorithm can be viewed as a derandomized version of Schöning’s probabilistic algorithm presented in [15]. The key point of our algorithm is t...
متن کاملA Local Search Algorithm for a SAT Representation of Scheduling Problems
This paper presents the application of a local search algorithm for a logical representation of the Job Shop Scheduling Problem (JSSP). This logical representation represents the JSSP transformed as a satisfiability problem (SAT). The proposed algorithm uses a local search in a wide neighborhood. This algorithm, called Walk Wide Search SAT, is a variant of the WalkSAT algorithm. This search is ...
متن کامل